Reusing Past Plans in Distributed Planning

نویسنده

  • Toshiharu Sugawara
چکیده

This paper describes plan reuse in multiagent domains. In distributed planning, a plan is created by distributed centers of planner agents that have their own viewpoints. Plan reuse where a past plan result is reused for the new problem was proposed for single-agent planning and can achieve efficient planning. A special issue for applying it to distributed planning is that, even if the local agent thinks that the new problem is identical to a past problem, other agents may have quite different goals. Another issue is to realize efficient distributed planning, like in a single-agent case. This paper shows that the past plan can be reused regardless of other agents’ goals under the assumption that the initial state has only "infacts." A generated plan and related information are stored as a plan template so that an agent can reuse it in future planning. This information includes generated plans, subgoals, non-local effects that may affect or be affected by other agents’ plans, and their conflict resolution methods that were actually used. An agent can create a plan efficiently using a template, because it can skip a part of planning actions, detect conflicts in an early stage, and reduce communication costs. First, this paper presents the planning-with-reuse framework. Then how plan templates are created and reused is also illustrated using some block world examples. Finally, we experimentally show that efficient distributed planning can be achieved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games

Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time required to traverse extensive search spaces makes traditional planning techniques unsuitable. In particular, in real-time domains, past plans need to be retrieved and adapted in real time and efficient plan adaptation techniques...

متن کامل

Probabilistically Reusing Plans in Deterministic Planning

Inspired by probabilistic path planning, we contribute a planning approach that probabilistically balances heuristics and past plans as guidance to planning search. Our ERRT-PLAN algorithm generates multiple search branches probabilistically choosing to extend them towards the current goal or towards actions or goals of a past given plan. We have defined domains to show where current techniques...

متن کامل

Experience Guided Mobile Manipulation Planning

The most critical moves that determine the success of a manipulation task are performed within the close vicinities of the object prior to grasping, and the goal prior to the final placement. Memorizing these state-action sequences and reusing them can dramatically improve the task efficiency, whereas even the state-of-the-art planning algorithms may require significant amount of time and compu...

متن کامل

Case-Based Instructional Planning for Learning in a Context

This paper describes an architecture of Intelligent Multimedia Tutoring System, called IMTS, which provides an environment that facilitates students to learn the course of Data Structure in a context. Three main teaching strategies on the basis of cognitive apprenticeship are discussed, which are program generation strategy, program completion strategy and program understanding strategy. To gen...

متن کامل

Plan Merging & Plan Reuse as Satisfiability

Planning as satissability has hitherto focused only on purely generative planning. There is an evidence in traditional reenement planning that planning incrementally by reusing or merging plans can be more eecient than planning from scratch (sometimes reuse is not eecient, but becomes necessary if the cost of abandoning the reusable plan is too high, when users are charged for the planning solu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995